A self-adaptive trust region method for the extended linear complementarity problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

an adaptive nonmonotone trust region method for unconstrained optimization problems based on a simple subproblem

using a simple quadratic model in the trust region subproblem, a new adaptive nonmonotone trust region method is proposed for solving unconstrained optimization problems. in our method, based on a slight modification of the proposed approach in (j. optim. theory appl. 158(2):626-635, 2013), a new scalar approximation of the hessian at the current point is provided. our new proposed method is eq...

متن کامل

A Trust-region Method using Extended Nonmonotone Technique for Unconstrained Optimization

In this paper, we present a nonmonotone trust-region algorithm for unconstrained optimization. We first introduce a variant of the nonmonotone strategy proposed by Ahookhosh and Amini cite{AhA 01} and incorporate it into the trust-region framework to construct a more efficient approach. Our new nonmonotone strategy combines the current function value with the maximum function values in some pri...

متن کامل

Improved infeasible-interior-point algorithm for linear complementarity problems

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

متن کامل

A Projected Algebraic Multigrid Method for Linear Complementarity Problems

We present an algebraic version of an iterative multigrid method for obstacle problems, called projected algebraic multigrid (PAMG) here. We show that classical algebraic multigrid algorithms can easily be extended to deal with this kind of problem. This paves the way for efficient multigrid solution of obstacle problems with partial differential equations arising, for example, in financial eng...

متن کامل

A New Method for Solving Non-Linear Complementarity Problems

The non-linear complementarity problem NLCP is to find a vector z in IR satisfying 0 6 z ⊥ f(z) > 0, where f is a given function. This problem can be solved by several methods but the most of these methods require a lot of arithmetic operations, and therefore, it is too difficult, time consuming, or expensive to find an approximate solution of the exact solution. In this paper we give a new met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applications of Mathematics

سال: 2009

ISSN: 0862-7940,1572-9109

DOI: 10.1007/s10492-009-0004-x